ANALYSIS OF SELECTION SCHEMES FOR SOLVING JOB SHOP SCHEDULING PROBLEM USING GENETIC ALGORITHM
نویسندگان
چکیده
منابع مشابه
Analysis of Selection Schemes for Solving Job Shop Scheduling Problem Using Genetic Algorithm
Scheduling problems have the standard consideration in the field of manufacturing. Among the various types of scheduling problems, the job shop scheduling problem is one of the most interesting NP-hard problems. As the job shop scheduling is an optimization problem, Genetic algorithm was selected to solve it In this study. Selection scheme is one of the important operators of Genetic algorithm....
متن کاملSolving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm
The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...
متن کاملSolving the Job Shop Scheduling Problem Using Parallel Genetic Algorithms
Extended Abstract The purpose of this paper is to present a thorough empirical analysis regarding the robustness, effectiveness and efficiency of four distinct genetic algorithm templates on the well known Job Shop Scheduling Problem (JSSP). Its popularity has maintained this combinatorial problem in the academic foray for the past five decades attracting researchers from the fields of combinat...
متن کاملA Job-shop Scheduling Problem (jssp) Using Genetic Algorithm (ga)
The job-shop scheduling (JSS) is a schedule planning for low volume systems with many variations in requirements. In job-shop scheduling problem (JSSP) environment, there are j jobs to be processed on m machines with a certain objective function to be minimized. JSSP with j jobs to be processed on more than two machines have been classified as a combinatorial problem. They cannot be formulated ...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2013
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2013.0211116